<html>
 <body>
  <a href="http://sudopedia.enjoysudoku.com/{9}_{10}.html">{0}</a>
   <p>
   All the candidates for <b>digit {1}</b> in the {2} highlighted <b>{3}s</b> are located in the intersections with the {2} highlighted <b>{4}s</b> 
   (not counting the {7} extra candidate{8} called "fin" in <b>{6}</b>).<br/>
   <ol>
   <li>either the fin is false and doesn't contain <b>digit {1}</b> then we have a basic <a href="http://sudopedia.enjoysudoku.com/{10}.html">{10}</a> 
   which means that each <b>{3}</b> must contain <b>digit {1}</b> in one of the intersecting cells and no other cell outside the intersections can contain <b>digit {1}</b></li>
   <li>or the fin is true and does contain <b>digit {1}</b> which would allow to eliminate candidates on the board too</li>
   </ol>
   Since one of the two possibilities has to be true (either the fin is false, then we have a basic {10}, or the fin is true),
   the intersection of the two sets of removable candidates can be eliminated, in this case <b>digit {1}</b> in <b>{5}</b>.
   </p>
 </body>
</html>